Comparison of suboptimal iterative Space-Time receivers
نویسنده
چکیده
At high spectral efficiencies, optimal decoding of Space Time Block Coded (STBC) Multiple Input Multiple Output (MIMO) systems has a critical complexity unless the space-time code structure offers simple optimal decoding, as is the case for Space Time Orthogonal Block Codes (STOBC). Indeed, the complexity of true Maximum Likelihood (ML) decoding or A Posteriori Probability (APP) decoding of STBC increase exponentially with the spectral efficiency. As a Soft Input Soft Output (SISO) decoding scheme, APP space-time decoding is of special interest since it allows the space-time receiver to efficiently work with a channel decoder. Besides, it can advantageously be used in an iterative manner with a SISO channel decoder to approach the optimal joint receiver performance. List Sphere Decoding (LSD) provides a good approximation of APP decoding with reduced complexity and can therefore be considered as a performance reference. This paper presents a new suboptimal SISO space-time receiver based on MMSE using priors, which has significantly lower complexity than LSD but turns out to perform similarly when used in an iterative receiver. The system under consideration is first presented, followed by a detailed description of the new proposed MMSE based receiver and a brief description of the reference LSD receiver. These two schemes are then evaluated in iterative receivers in terms of performance and complexity.
منابع مشابه
Performance of Turbo Interference Cancellation Receivers in Space-Time Block Coded DS-CDMA Systems
We investigate the performance of turbo interference cancellation receivers in the space time block coded (STBC) direct-sequence code division multiple access (DS-CDMA) system. Depending on the concatenation scheme used, we divide these receivers into the partitioned approach (PA) and the iterative approach (IA) receivers. The performance of both the PA and IA receivers is evaluated in Rayleigh...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملBounded Suboptimal Search in Linear Space: New Results
Bounded suboptimal search algorithms are usually faster than optimal ones, but they can still run out of memory on large problems. This paper makes three contributions. First, we show how solution length estimates, used by the current stateof-the-art linear-space bounded suboptimal search algorithm Iterative Deepening EES, can be used to improve unboundedspace suboptimal search. Second, we conv...
متن کاملIterative receivers for coded MIMO signaling
In this tutorial paper we describe iterative receivers that combine a soft decoder for a general space–time code with a spatialinterference canceler. The performance of these receivers is analyzed by using EXIT charts, a convenient graphical description that yields quite accurate results. By properly combining the EXIT characteristics of the canceler and of the decoder, the convergence behavior...
متن کامل